A Genetic Algorithm for Solving Job-shop Scheduling Problems using the Parameter-free Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
Solving Job-Shop Scheduling Problems by Genetic Algorithm
Job-shop Scheduling Problem (JSP) is one of extremely hard problems because it requires very large combinatorial search space and the precedence constraint between machines. The traditional algorithm used to solve the problem is the branch-andbound method, which takes considerable computing time when the size of problem is large. W e propose a new method for solving JSP using Genetic Algorithm ...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملPerformance Evaluation of a Parameter-Free Genetic Algorithm for Job-Shop Scheduling Problems
The job-shop scheduling problem (JSSP) is well known as one of the most difficult NP-hard combinatorial optimization problems. Genetic Algorithms (GAs) for solving the JSSP have been proposed, and they perform well compared with other approaches [1]. However, the tuning of genetic parameters has to be performed by trial and error, making optimization by GA ad hoc. To address this problem, Sawai...
متن کاملJob Shop Scheduling Using Genetic Algorithm
Job shop scheduling problem is one of the most important problems in the combinatorial optimization problems and it is applied to various fields about engineering. Many works have been reported for this problem using Genetic Algorithm (GA). The GA is one of the most powerful optimization methods based on the mechanics of natural evolution. In this paper, we propose a new algorithm for the job s...
متن کاملA Genetic Algorithm for Job-Shop Scheduling
In this paper, we analyze the characteristics of the job shop scheduling problem. A new genetic algorithm for solving the agile job shop scheduling is presented to solve the job shop scheduling problem. Initial population is generated randomly. Two-row chromosome structure is adopted based on working procedure and machine distribution. The relevant crossover and mutation operation is also desig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2003
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss.123.130